package com.blink.optimize.algorithm.lfu;

/**
 * <Description> 最小堆</Description>
 * <ClassName> SmallHeapDemo</ClassName>
 *
 * @Author liuxianzhao
 * @Date 2018年01月09日 13:18
 */
public class SmallHeapDemo {
    final static int MAX_LEN = 100;
    private int[] queue = new int[MAX_LEN];
    private int size;

    public void add(int e) {

    }

    public int size() {
        return size;
    }

    private void shiftup(int s, int e) {
        while (s > 0) {
            int parent = (s - 1) / 2;
            if (queue[parent] < e) {
                break;
            }
            queue[parent] = queue[s];
        }
        queue[s] = e;
    }

    private void shiftdown(int i, int e) {

    }

    public int poll() {
        return 0;
    }

    public static void main(String[] args) {

    }
}
